Lecture 4 — September 17 4.1 Digital Fountain Characterization 4.1.1 Limitations of Building Digital Fountain with Rs Codes
نویسندگان
چکیده
A Digital Fountain is an approach used to provide reliability in multicast networks without the use of receiver initiated packet retransmissions. Prior work to Digital Fountain has shown that use of receiver initiated retransmissions to recover lost data is unscalable in multicast networks and the impact is significant in lossy networks. Instead, like many other techniques that transmit redundant codewords, Digital Fountain uses the concept of encoding data using Tornado and LT codes such that reconstruction of data at the receiver is done with minimal overhead. The intuition behind Digital Fountain is that there is a tradeoff between decoding time and decoding efficiency. By accepting an almost negligible penalty of decoding inefficiency, significant improvements are achieved for encoding and decoding times . In the following section, we discuss the limitations of RS codes to make the advantages of Tornado and LT codes clear.
منابع مشابه
Trapping Sets in Fountain Codes over Noisy Channels
Fountain codes have demonstrated great results for the binary erasure channel and have already been incorporated into several international standards to recover lost packets at the application layer. These include multimedia broadcast/multicast sessions and digital video broadcasting on global internet-protocol. The rateless property of Fountain codes holds great promise for noisy channels. The...
متن کاملWyner-Ziv Video Compression and Fountain Codes for Receiver-Driven Layered Multicast
The proliferation of video streaming applications that distribute data to a large number of clients motivates the design of fast and reliable multimedia delivery systems capable to adapt effectively to diverse transmission conditions. Receiver-driven layered multicast (RLM) efficiently addresses the issue of heterogeneity in clients’ available bandwidths and packet loss rates by shifting rate c...
متن کاملAdvanced Algorithms December 23 , 2004 Lecture 20 : LT Codes Lecturer : Amin
Random linear fountain codes were introduced in the last lecture as a sparse-graph codes for channels with erasure. It turned out that their encoding and decoding costs were quadratic and cubic in the number of packets encoded. We study Luby Transform (LT) codes in this lecture, pioneered by Michael Luby, that retains the good performance of random linear fountain code, while drastically reduci...
متن کاملDigital Fountain Codes System Model and Performance over AWGN and Rayleigh Fading Channels
Digital fountain codes were originally packet-level forward erasure codes, but researchers have found that they are good at correcting bit errors. Modern LDPC and turbo codes have been shown to approach the Shannon limit. However, they are fixed rate codes and cannot well satisfy the Internet services that may encounter variable loss rates or asynchronous data access. For both packet and bit le...
متن کاملA digital fountain approach to asynchronous reliable multicast
The proliferation of applications that must reliably distribute large, rich content to a vast number of autonomous receivers motivates the design of new multicast and broadcast protocols. We describe an ideal, fully scalable protocol for these applications that we call a digital fountain. A digital fountain allows any number of heterogeneous receivers to acquire content with optimal efficiency ...
متن کامل